How to analyse evolutionary algorithms
نویسندگان
چکیده
منابع مشابه
How to analyse evolutionary algorithms
Many variants of evolutionary algorithms have been designed and applied. The experimental knowledge is immense. The rigorous analysis of evolutionary algorithms is di/cult, but such a theory can help to understand, design, and teach evolutionary algorithms. In this survey, 0rst the history of attempts to analyse evolutionary algorithms is described and then new methods for continuous as well as...
متن کاملEvolutionary Algorithms : What , When , and How ?
Genetic algorithms (GAs) are a class of heuristic search methods based on natural selection. These algorithms find application in NP-Hard optimizations problems that do not solve efficiently using strictly analytic methods. The past decade saw an overwhelming increase in GA application in the real-world. However, many practitioners apply these algorithms hastily using software packages such as ...
متن کاملEvolutionary Algorithms to Analyse and Design a Controller for a Flapping Wings Aircraft
Evolutionary Algorithms are now mature optimization tools, especially in a multi-objective context. This ability is used here to help explore, analyse and, on this basis, propose a controller for a complex robotics system: a flapping wings aircraft. A multi-objective optimization is performed to find the best parameters of sinusoidal wings kinematics. Multi-objective algorithms generate a set o...
متن کاملEstimation of LPC coefficients using Evolutionary Algorithms
The vast use of Linear Prediction Coefficients (LPC) in speech processing systems has intensified the importance of their accurate computation. This paper is concerned with computing LPC coefficients using evolutionary algorithms: Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Dif-ferential Evolution (DE) and Particle Swarm Optimization with Differentially perturbed Velocity (PSO-DV...
متن کاملIntroduction to Evolutionary Algorithms
Evolutionary Algorithms (EA) consist of several heuristics, which are able to solve optimisation tasks by imitating some aspects of natural evolution. They may use different levels of abstraction, but they are always working on whole populations of possible solutions for a given task. EAs are an approved set of heuristics, which are flexible to use and postulate only neglectible requirements on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00137-8